﻿#include <iostream>
#include <stack>
#include <vector>
#include "Util.hpp"
#include "Chapter 2/BenchmarkDivide.hpp"
#include "Chapter 3/Calculator.hpp"
#include "Chapter 3/CyclicQueue.hpp"
#include "Chapter 3/Permutation.hpp"
#include "Chapter 4/KMP.hpp"
#include "Chapter 4/DelChar.hpp"
#include "Chapter 5/OrthoList.hpp"
#include "Chapter 6/BiTree.hpp"
#include "Chapter 7/ListGraph.hpp"
#include "Chapter 7/UndirectedListGraph.hpp"
#include "Chapter 7/DirectedListGraph.hpp"
#include "Chapter 7/WeightedDirectedMatGraph.hpp"
#include "Chapter 8/Sort.hpp"

using namespace std;
using namespace Chapter3;
using namespace Chapter4;
using namespace Chapter5;

int main() {
    WeightedDirectedMatGraph graph(6);
    graph.addEdge(0, 1, 10);
    graph.addEdge(0, 2, 10);
    graph.addEdge(1, 2, 2);
    graph.addEdge(1, 3, 4);
    graph.addEdge(1, 4, 8);
    graph.addEdge(2, 4, 9);
    graph.addEdge(4, 3, 6);
    graph.addEdge(3, 5, 10);
    graph.addEdge(4, 5, 10);
    cout << graph.maxFlow(0, 5) << endl;
    set<int> S, T;
    graph.minCut(S, T, 0, 5);
    cout << endl;
}